Date: Tue, 10 Dec 1996 16:51:58 GMT
Server: NCSA/1.4.2
Content-type: text/html

<HTML>
<head>
<title>CSE 321 Assignment #4</title>
</head>
<body>
<h1>CSE 321 Assignment #4<br>Autumn 1996</h1>
<h3>Due: Friday, October 25, 1996.
<br>

</h3>
<p>
Reading Assignment: Read sections 3.2 and 3.3 of the text.
The following problems are from the Third Edition of the text.
 
<p>
Practice Problems: page 198, Problem 5; page 199, Problem 21.
<p> Problems: 
<ol>
<p><li> Prove that the square of an integer not divisible by 6 leaves a
remainder of 1, 3 or 4 when divided by 6.  (Hint:  Use a proof by cases,
one case per possible remainder when the integer is divided by 6.)
<p><li> page 198, Problem 8
<p><li> page 198, Problem 10.  (Recall that n! is the product of the numbers
from 1 to n.)
<p><li> page 199, Problem 18
<p><li> page 199, Problem 20
<p><li> page 199, Problem 28
<p><li> (Bonus) page 200, Problem 50
</ol>
</body>
</html>
